Parameter Synthesis in Markov Models: A Gentle Survey

نویسندگان

چکیده

AbstractThis paper surveys the analysis of parametric Markov models whose transitions are labelled with functions over a finite set parameters. These symbolic representations uncountable many concrete probabilistic models, each obtained by instantiating We consider various problems for given logical specification \(\varphi \): do all parameter instantiations within region values satisfy \)?, which \) and ones not?, how can such be characterised, either exactly or approximately? address theoretical complexity results describe main ideas underlying state-of-the-art algorithms that established an impressive leap last decade enabling fully automated millions states thousands

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parameter Synthesis for Markov Models: Faster Than Ever

We propose a simple technique for verifying probabilistic models whose transition probabilities are parametric. The key is to replace parametric transitions by nondeterministic choices of extremal values. Analysing the resulting parameter-free model using off-the-shelf means yields (refinable) lower and upper bounds on probabilities of regions in the parameter space. The technique outperforms t...

متن کامل

A Gentle Tutorial of the EM Algorithm and its Application to Parameter Estimation for Gaussian Mixture and Hidden Markov Models

We describe the maximum-likelihood parameter estimation problem and how the ExpectationMaximization (EM) algorithm can be used for its solution. We first describe the abstract form of the EM algorithm as it is often given in the literature. We then develop the EM parameter estimation procedure for two applications: 1) finding the parameters of a mixture of Gaussian densities, and 2) finding the...

متن کامل

Parameter estimation in pair hidden Markov models

This paper deals with parameter estimation in pair hidden Markov models (pairHMMs). We first provide a rigorous formalism for these models and discuss possible definitions of likelihoods. The model being biologically motivated, some restrictions with respect to the full parameter space naturally occur. Existence of two different Information divergence rates is established and divergence propert...

متن کامل

Parameter identification in Markov chain choice models

This work studies the parameter identification problem for the Markov chain choice model of Blanchet, Gallego, and Goyal used in assortment planning. In this model, the product selected by a customer is determined by a Markov chain over the products, where the products in the offered assortment are absorbing states. The underlying parameters of the model were previously shown to be identifiable...

متن کامل

A Gentle Introduction to Sequential Parameter Optimization

There is a strong need for sound statistical analysis of simulation and optimization algorithms. Based on this analysis, improved parameter settings can be determined. This will be referred to as tuning. Model-based investigations are common approaches in simulation and optimization. The sequential parameter optimization toolbox SPOT package for R [5] is a toolbox for tuning and understanding s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-22337-2_20